Scoped Dynamic Rewrite Rules
نویسنده
چکیده
ion Generate new variable name and renaming rule for variables: NewVar : x -> y where new => y ; rules(RenameVar : Var(x) -> Var(y)) Can be used in renaming of many binding constructs.
منابع مشابه
Program Transformation with Scoped Dynamic Rewrite Rules
The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the context-free nature of rewrite rules. The first problem is addressed by languages supporting user-definable rewriting strategies. The second problem is addressed by the extension of rewriting strategies with scoped dynamic rewrite rules. Dynamic rules are defined at r...
متن کاملAn Operational Semantics of Lexically-Scoped Dynamic Variables
Lexical and dynamic scoping are the two primary approaches to variable binding in functional programming languages. While medieval Lisp dialects commonly featured dynamic scoping, most languages today emphasize lexical scoping. This is a sensible choice: lexical scoping enables local reasoning about programs at the source code level. Nonetheless, dynamic variables are more appropriate for certa...
متن کاملPort Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk)
In the context of understanding, planning and anticipating the behaviour of complex systems, such as biological networks or social networks, this paper proposes port graphs, rules and strategies, combined in strategic rewrite programs, as foundational ingredients for interactive and visual programming and shows how they can contribute to dynamic data analytics. 1998 ACM Subject Classification D...
متن کاملModular Algebraic Speciications and the Orientation of Equations into Rewrite Rules ?
We consider the problem of orienting equations into rewrite rules in the framework of a modular algebraic speciication language. When a speciication is built from \modules", the orientation should neither be done globally for all modules, nor independently for each module. The termination ordering we deene respects the modules boundaries. Equations of a module are partitioned into two sets: the...
متن کاملRewriting Strategies for Instruction Selection
Instruction selection (mapping IR trees to machine instructions) can be expressed by means of rewrite rules. Typically, such sets of rewrite rules are highly ambiguous. Therefore, standard rewriting engines based on fixed, exhaustive strategies are not appropriate for the execution of instruction selection. Code generator generators use special purpose implementations employing dynamic programm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 59 شماره
صفحات -
تاریخ انتشار 2001